A Split-Based Incremental Deterministic Automata Minimization Algorithm
نویسندگان
چکیده
منابع مشابه
A polynomial double reversal minimization algorithm for deterministic finite automata
We here propose a polynomial-time deterministic finite automaton minimization algorithm directly derived from Brzozowski’s double reversal algorithm. To do so, we take into account the framework by Brzozowski and Tamm, to propose an atomization algorithm that allows us to achieve polynomial time complexity. © 2013 Elsevier B.V. All rights reserved.
متن کاملSAT-based Minimization of Deterministic ω-Automata
We describe a tool that inputs a deterministic ω-automaton with any acceptance condition, and synthesizes an equivalent ω-automaton with another arbitrary acceptance condition and a given number of states, if such an automaton exists. This tool, that relies on a SAT-based encoding of the problem, can be used to provide minimal ω-automata equivalent to given properties, for different acceptance ...
متن کاملAn Incremental Algorithm for Minimal Deterministic Finite Cover Automata
A fast incremental algorithm for constructing minimal DFCA for a given language is presented. Since it was shown that the DFCA for a language L can have less states than the DFA for L, this techniques seems to be the best choice for incrementally building the automaton for a large language especially when the number of states in the DFCA is significantly less than the number of states in the “e...
متن کاملEfficient Deterministic Finite Automata Minimization Based on Backward Depth Information
Obtaining a minimal automaton is a fundamental issue in the theory and practical implementation of deterministic finite automatons (DFAs). A minimization algorithm is presented in this paper that consists of two main phases. In the first phase, the backward depth information is built, and the state set of the DFA is partitioned into many blocks. In the second phase, the state set is refined usi...
متن کاملEfficient minimization of deterministic weak ω-automata
We analyze the minimization problem for deterministic weak automata, a subclass of deterministic Büchi automata, which recognize the regular languages that are recognizable by deterministic Büchi and deterministic co-Büchi automata. We reduce the problem to the minimization of finite automata on finite words and obtain an algorithm running in time O(n · logn), where n is the number of states of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2014
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-014-9588-y